OPTIMIZATION OF LOCAL PARALLEL INDEX (LPI) IN PARALLEL/DISTRIBUTED DATABASE SYSTEMS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Local Parallel Index (lpi) in Parallel/distributed Database Systems

The widespread growth of data has created many problems for businesses, such as delay requests; in this paper, we propose several methods of partitioning an index B*Tree in multi-processor machines in parallel/distributed database systems and collaboration between processors when executing multi-queries. When optimizing, indexing automatically comes to mind; we distinguish two types of indexing...

متن کامل

Index File Partitioning in Parallel Database Systems

In a parallel database system, a table is often partitioned into multiple fragments and stored on diierent nodes in order to exploit I/O parallelism. Since using an index is typical for processing a database query, the problem of how to design the index for such partitioned tables can be a crucial performance factor in a parallel database. In terms of the index for partitioned tables, we can th...

متن کامل

Join Query Optimization in Parallel Database Systems

In this paper we present a new framework for studying parallel query optimization. We first note that scheduling and optimization must go together in a parallel environment. We introduce the concept of response time envelopes which integrates scheduling and optimization. We show that it can be used effectively to develop parallel query optimization algorithms which have same order of complexity...

متن کامل

Parallel Selection Query Processing Involving Index in Parallel Database Systems

Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection, join) on this attribute will become more efficient by utilizing the index. In this paper we focus on parallel algorithms for selection queries involving index – that is data searching on indexed attributes. In this pa...

متن کامل

Sorting in Parallel Database Systems

Sorting in database processing is frequently required through the use of Order By and Distinct clauses in SQL. Sorting is also widely known in computer science community at large. Sorting in general covers internal and external sorting. Past published work has extensively focused on external sorting on uni-processors (serial external sorting), and internal sorting on multiprocessors (parallel i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Geomate

سال: 2016

ISSN: 2186-2990

DOI: 10.21660/2016.27.1322